A class of vertex-transitive digraphs
نویسندگان
چکیده
منابع مشابه
Exponents of vertex-transitive digraphs
A digraph D is primitive if, for some positive integer r, there is a u ! v walk of length r for every pair u; v of vertices of D. The minimum such r is called the exponent of D, denoted exp(D). We prove that if a primitive digraph D of order n is an Abelian Cayley digraph with degree k 4, then exp(D) max n 5; n dk=2e 1 o : If we assume only that the primitive digraph D is vertex-transitive, the...
متن کاملOn Vosperian and Superconnected Vertex-Transitive Digraphs
We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We improve most of the existing results in this area.
متن کاملVertex-Transitive Digraphs of Order $p^5$ are Hamiltonian
We prove that connected vertex-transitive digraphs of order p5 (where p is a prime) are Hamiltonian, and a connected digraph whose automorphism group contains a finite vertex-transitive subgroup G of prime power order such that G′ is generated by two elements or elementary abelian is Hamiltonian.
متن کاملVertex heaviest paths and cycles in quasi-transitive digraphs
A digraph D is called a quasi-transitive digraph (QTD) if for any triple x, y, z of distinct vertices of D such that (x, y) and (y, z) are arcs of D there is at least one arc from x to z or from z to x. Solving a conjecture by J. Bang-Jensen and J. Huang (J. Graph Theory, to appear), G. Gutin (Australas. J. Combin., to appear) described polynomial algorithms for finding a Hamiltonian cycle and ...
متن کاملDistance Sequences In Locally Infinite Vertex-Transitive Digraphs
We prove that the out-distance sequence {f(k)} of a vertex-transitive digraph of finite or infinite degree satisfies f(k + 1) ≤ f(k) for k ≥ 1, where f(k) denotes the number of vertices at directed distance k from a given vertex. As a corollary, we prove that for a connected vertextransitive undirected graph of infinite degree d, we have f(k) = d for all k, 1 ≤ k < diam(G). This answers a quest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1973
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90007-5